A Hopfield Neural Network Approach to the Single Machine Scheduling Problem
ثبت نشده
چکیده
The Single Machine Scheduling with Changeover Costs problem is found in many different workshops. In this case, the main criterion is the sequence-dependent changeover-costs or setup times. This Scheduling problem can be modeled as a Traveling Salesman Problem (TSP) and when time constraints are inserted into the model such as due-dates, the resulting problem is known as the Time Dependent Traveling Salesman Problem. In order to solve the Single Machine Scheduling problem it was used a Hopfield Neural Network approach. Finally, in the end of this work it is presented comparative results with other methods using an industrial data set.
منابع مشابه
A Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کاملReal-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm
The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...
متن کاملForward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning
The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...
متن کاملA novel Hopfield neural network approach for minimizing total weighted tardiness of jobs scheduled on identical machines
This paper explores fast, polynomial time heuristic approximate solutions to the NP-hard problem of scheduling jobs on N identical machines. The jobs are independent and are allowed to be stopped and restarted on another machine at a later time. They have well-defined deadlines, and relative priorities quantified by non-negative real weights. The objective is to find schedules which minimize th...
متن کاملA Coupled Transiently Chaotic Neural Network Approach for Scheduling Identical Parallel Machines with Sequence Dependent Setup Times
Identical parallel machine scheduling problems with sequence dependent setup times, to minimize the total completion time are studied in this paper. A mixed-integer programming formulation of this problem is presented. And a neural computation architecture based on a Coupled Transiently Chaotic Neural Network is introduced to construct the model. The transiently chaotic dynamics are defined aft...
متن کامل